package test.queue;

import java.util.LinkedList;
import java.util.Queue;

public class MyStack {
    Queue<Integer> queue;
    /** Initialize your data structure here. */

    public MyStack() {
        queue = new LinkedList<Integer>();
    }

    /** Push element x onto stack. */
    public void push(int x) {
        queue.add(x);

    }

    /** Removes the element on top of the stack and returns that element. */
    /*public int pop() {
        if (queue.isEmpty()) {
            return -1;
        }
        queue.remove()

    }

    *//** Get the top element. *//*
    public int top() {

    }

    *//** Returns whether the stack is empty. *//*
    public boolean empty() {

    }*/
}
